Efficient Protein Loop Generation using Distance-Guided Sequential Monte Carlo Method
نویسندگان
چکیده
منابع مشابه
Fast Protein Loop Sampling and Structure Prediction Using Distance-Guided Sequential Chain-Growth Monte Carlo Method
Loops in proteins are flexible regions connecting regular secondary structures. They are often involved in protein functions through interacting with other molecules. The irregularity and flexibility of loops make their structures difficult to determine experimentally and challenging to model computationally. Conformation sampling and energy evaluation are the two key components in loop modelin...
متن کاملEfficient Sequential Monte Carlo Using Interpolation
A limitation common to all sequential Monte Carlo algorithms is the computational demand of accurately describing an arbitrary distribution, which may preclude real-time implementation for some systems. We propose using interpolation to construct a high accuracy approximation to the importance density. The surrogate density can then be efficiently evaluated in place of sampling the true importa...
متن کاملSequential Monte Carlo-guided ensemble tracking
A great deal of robustness is allowed when visual tracking is considered as a classification problem. This paper combines a finite number of weak classifiers in a SMC framework as a strong classifier. The time-varying ensemble parameters (confidence of weak classifiers) are regarded as sequential arriving states and their posterior distribution is estimated in a Bayesian manner. Therefore, both...
متن کاملMemory (and Time) Efficient Sequential Monte Carlo
Memory efficiency is an important issue in Sequential Monte Carlo (SMC) algorithms, arising for example in inference of high-dimensional latent variables via Rao-Blackwellized SMC algorithms, where the size of individual particles combined with the required number of particles can stress the main memory. Standard SMC methods have a memory requirement that scales linearly in the number of partic...
متن کاملBayesian Phylogenetic Inference using a Combinatorial Sequential Monte Carlo Method
The application of Bayesian methods to large scale phylogenetics problems is increasingly limited by computational issues, motivating the development of methods that can complement existing Markov Chain Monte Carlo (MCMC) schemes. Sequential Monte Carlo (SMC) methods are approximate inference algorithms that have become very popular for time series models. Such methods have been recently develo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Biophysical Journal
سال: 2012
ISSN: 0006-3495
DOI: 10.1016/j.bpj.2011.11.1007